An Efficient Gateway Election Algorithm for Clusters in MANET

The dynamic nature of Mobile ad hoc network brought several constraints like scalability, robust connectivity, limited power constraints etc. Several cluster based routing algorithms have been proposed for large scale ad hoc networks. In cluster-based routing, the network is logically divided into groups called clusters. The aim of this grouping is to sustain a steady and effective network topology. The election of gateways during inter cluster routing is a critical issue. In this paper, an optimized gateway election algorithm, have been proposed which aims at minimizing the control overhead required in the set up and maintenance of the network, while maintaining robust connectivity. This technique is a unique way of addressing the issues of dynamic adaptation through a hierarchical cluster based approach along with Virtual Identifier. The simulation results show that the proposed technique gives better performance over various gateway election algorithms in terms of packet delivery ratio, routing overhead, end to end delay, and throughput. General Terms Clustering, gateway election